منابع مشابه
On a class of weak Tchebycheff systems
In this paper we study the approximation power, the existence of a normalized B-basis and the structure of a degree-raising process for spaces of the form span < 1, x, . . . , x, u(x), v(x) >, requiring suitable assumptions on the functions u and v. The results about degree raising are detailed for special spaces of this form which have been recently introduced in the area of CAGD.
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملCombinatorics of generalized Tchebycheff polynomials
By considering a family of orthogonal polynomials generalizing the Tchebycheff polynomials of the second kind we refine the corresponding results of De Sainte-Catherine and Viennot on Tchebycheff polynomials of the second kind (Lecture Notes in Mathematics, vol. 1171, 1985, Springer-Verlag, 120). © 2003 Elsevier Science Ltd. All rights reserved.
متن کاملdesigning unmanned aerial vehicle based on neuro-fuzzy systems
در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...
Multi Agent Collaborative Search based on Tchebycheff decomposition
This paper presents a novel formulation ofMulti Agent Collaborative Search, for multi-objective optimization, based on Tchebycheff decomposition. A population of agents combines heuristics that aim at exploring the search space both globally (social moves) and in a neighborhood of each agent (individualistic moves). In this novel formulation the selection process is based on a combination of Tc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1978
ISSN: 0021-9045
DOI: 10.1016/0021-9045(78)90084-9